A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation

Time - Varying K Shortest Paths

K shortest paths in stochastic time-dependent networks

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns succes...

Shortest Paths in Stochastic Time-dependent Networks with Link Travel Time Correlation

This paper develops a simple robust framework for the problem of finding the least expected travel time route from any node to any given destination in a stochastic and time-dependent network. We consider both spatial and temporal link travel time correlations in the proposed solution based on a dynamic programming approach. In particular, the spatial correlation is represented by a Markovian p...

A polynomial-time algorithm to find shortest paths with recourse

The Shortest Path with Recourse Problem involves finding the shortest expected-length paths in a directed network each of whose arcs have stochastic traversal lengths (or delays) that become known only upon arrival at the tail of that arc. The traveler starts at a given source node, and makes routing decisions at each node in such a way that the expected distance to a given sink node is minimiz...

A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths

We study dynamic (1 + )-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n + m) while keeping the query time...